Comparison of a mixed least-squares formulation using different approximation spaces
نویسندگان
چکیده
منابع مشابه
Shape Recognition using the Least Squares Approximation
This paper represents a novel algorithm to represent and recognize two dimensional curve based on its convex hull and the Least-Squared modeling. It combines the advantages of the property of the convex hulls that are particularly suitable for affine matching as they are affine invariant and the geometric properties of a contour that make it more or less identifiable. The description scheme and...
متن کاملParametric least squares approximation using gamma bases
We study the problem of linear approximation of a signal using the parametric Gamma bases in L2 space. These bases have a time scale parameter which has the effect of modifying the relative angle between the signal and the projection space, thereby yielding an extra degree of freedom in the approximation. Gamma bases have a simple analog implementation which is a cascade of identical lowpass fi...
متن کاملLeast Squares Approximation
In many applications we want to find an approximation for a function, for example for differential equations. Example problem: We want to understand how a calculator or computer can evaluate sinx for a given value x. The processor can essentially only perform addition, multiplication, division. Therefore we can try to approximate the function with a polynomial. We use the notation Pn for polyno...
متن کاملLeast-squares polynomial approximation
We construct symmetric polar WAMs (Weakly Admissible Meshes) with low cardinality for least-squares polynomial approximation on the disk. These are then mapped to an arbitrary triangle. Numerical tests show that the growth of the least-squares projection uniform norm is much slower than the theoretical bound, and even slower than that of the Lebesgue constant of the best known interpolation poi...
متن کاملFaster Least Squares Approximation
Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets n be the number of constraints and d be the number of variables, with n d. Then, existing exact methods find a solution vector in O(nd2) time. We present two randomized algorithms that provide accurate relative-error approximations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2015
ISSN: 1617-7061
DOI: 10.1002/pamm.201510107